Parallel R-Tree Spatial Join for a Shared-Nothing Architecture
نویسندگان
چکیده
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This paper proposes a Replicated Parallel Packed R-tree and its use in performing the parallel R-tree join. We examine performance using the Digital Chart of the World Data on a shared nothing machine. Our experimental results show that the proposed tree and heuristics for load balancing improve Parallel R-tree join.
منابع مشابه
Parallel Algorithms for High-Dimensional Proximity Joins
We consider the problem of parallelizing highdimensional proximity joins. We present a parallel multidimensional join algorithm based on an the epsilon-kdB tree and compare it with the more common approach of space partitioning. An evaluation of the algorithms on an IBM SP2 shared-nothing multiprocessor is presented using both synthetic and real-life datasets. We also examine the effectiveness ...
متن کاملMaster-Client R-Trees: A New Parallel R-Tree Architecture
Scientiic databases must be able to eeciently run subset retrievals of multi-dimensional data sets. If the data sets are very large signiicant retrieval speedups can be obtained via parallelism. In this paper we present a new parallel distributed shared nothing Rtree architecture. To the best of our knowledge this is the rst signiicant experimental study demonstrating practical application of p...
متن کاملHandling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.o be more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particularly efficient and easily parallelized for this computation model. However, this hardware structure is very sensitive to the data skew problem. Unless the parallel hash join algorithm includes some load balancing mec...
متن کاملPipelined Parallelism in Multi-Join Queries on Heterogeneous Shared Nothing Architectures
Pipelined parallelism was largely studied and successfully implemented, on shared nothing machines, in several join algorithms in the presence of ideal conditions of load balancing between processors and in the absence of data skew. The aim of pipelining is to allow flexible resource allocation while avoiding unnecessary disk input/output for intermediate join results in the treatment of multi-...
متن کاملOn the Performance of Parallel Join Processing in Shared Nothing Database Systems
Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems represent the major architecture for parallel database processing. While the performance of such systems has been extensively analyzed in the past, the corresponding studies have made a number of best-case assumptions. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999